Genetic Algorithm with Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks using Neural Networks
نویسندگان
چکیده
-This paper presents a novel approach for finding dynamic shortest path in MANET using Genetic Algorithm with Memory schemes and Immigrants and compare that solutions with the result of Radial Basis Functional Network (RBFN) for getting global optimum route. At any time the dynamic location of the node is predicted by location prediction algorithm. The node will be able to periodically record its location by GPS (Global Positioning System) receiver.
منابع مشابه
Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks
In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor net...
متن کاملMicrosoft Word - C 1
In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dyna...
متن کاملMulti-population Genetic Algorithms with Immigrants Scheme for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks
The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless mesh network, etc. One of the most important ch...
متن کاملSecuring AODV routing protocol against the black hole attack using Firefly algorithm
Mobile ad hoc networks are networks composed of wireless devices to create a network with the ability for self-organization. These networks are designed as a new generation of computer networks to satisfy some specific requirements and with features different from wired networks. These networks have no fixed communication infrastructure and for communication with other nodes the intermediate no...
متن کاملDetermining Cluster-Heads in Mobile Ad-Hoc Networks Using Multi-Objective Evolutionary based Algorithm
A mobile ad-hoc network (MANET), a set of wirelessly connected sensor nodes, is a dynamic system that executes hop-by-hop routing independently with no external help of any infrastructure. Proper selection of cluster heads can increase the life time of the Ad-hoc network by decreasing the energy consumption. Although different methods have been successfully proposed by researchers to tackle...
متن کامل